Fractional covers for forests and matchingsPADBERG, M. W; WOLSEY, L. A.Mathematical programming. 1984, Vol 29, Num 1, pp 1-14, issn 0025-5610Article

Induced forests in cubic graphsSTATON, W.Discrete mathematics. 1984, Vol 49, Num 2, pp 175-178, issn 0012-365XArticle

On operator and formal sum methods for graph enumeration problemsLIU, C. J; YUTZE CHOW.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 384-406, issn 0196-5212Article

On the reconstruction of rayless infinite forestsANDREAE, T; SCHMIDT, R.Journal of graph theory. 1984, Vol 8, Num 3, pp 405-422, issn 0364-9024Article

Graph minors. I: Excluding a forestROBERTSON, N; SEYMOUR, P. D.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 39-61, issn 0095-8956Article

On the linear vertex-arboricity of a planar graphPOH, K. S.Journal of graph theory. 1990, Vol 14, Num 1, pp 73-75, issn 0364-9024Article

Distributions limites de la hauteur d'une forêt aléatoirePAVLOV, YU. L.Teoriâ verojatnostej i eë primeneniâ. 1983, Vol 28, Num 3, pp 449-457, issn 0040-361XArticle

Minimum cost K-forest coversBAAS, S. M; ORESTES CERDEIRA, J.Mathematical methods of operations research (Heidelberg). 1996, Vol 44, Num 2, pp 255-265, issn 1432-2994Article

Forest iteration method for stochastic transportation problemLIQUN QI.Mathematical programming study. 1985, Num 25, pp 142-163, issn 0303-3929Article

A STATUS ON THE LINEAR ARBORICITYAKIYAMA J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 38-44; BIBL. 16 REF.Conference Paper

Balloting labelling and personnel assignmentWEI, W. D; CAI, Y. Z; LIU, C. L et al.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 150-158, issn 0196-5212Article

Matroids and a forest cover problemORESTES CERDEIRA, J.Mathematical programming. 1994, Vol 66, Num 3, pp 403-405, issn 0025-5610Article

k-Connectivity and decomposition of graph into forestsNISHIZEKI, T; POLJAK, S.Discrete applied mathematics. 1994, Vol 55, Num 3, pp 295-301, issn 0166-218XArticle

Studies on hypergraphs. I: hyperforestsZHANG, L.Discrete applied mathematics. 1993, Vol 42, Num 1, pp 95-112, issn 0166-218XArticle

Fractals arithmétiques = Arithmetic fractalsLong, Lun-Hai; Reveillès, Jean-Pierre.1993, 113 p.Thesis

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

Sur les distributions du nombre de sommets dans les couches d'une forêt aléatoirePAVLOV, YU. L.Teoriâ verojatnostej i eë primeneniâ. 1988, Vol 33, Num 1, pp 105-114, issn 0040-361XArticle

Morphological segmentation produces a Voronoï tesselation of the markersMEYER, Fernand.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol5, 3077-3080Conference Paper

Multicolored forests in bipartite decompositions of graphsALON, N; BRUALDI, R. A; SHADER, B. L et al.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 1, pp 143-148, issn 0095-8956Article

How to build argumental graphs using TAG shared forest : A view from control verbs problematicSEDDAH, Djamé; GAIFFE, Bertrand.Lecture notes in computer science. 2005, pp 287-300, issn 0302-9743, isbn 3-540-25783-7, 14 p.Conference Paper

The number of maximal independent sets in triangle-free graphsHUJTER, M; TUZA, Z.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 2, pp 284-288, issn 0895-4801Article

A new bijection on rooted forestsERDOS, P. L.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 179-188, issn 0012-365XConference Paper

A polyhedral intersection theorem for capacitated spanning treesHALL, L. A; MAGNANTI, T. L.Mathematics of operations research. 1992, Vol 17, Num 2, pp 398-410, issn 0364-765XArticle

A ternary search problem on graphsANDREAE, T.Discrete applied mathematics. 1989, Vol 23, Num 1, pp 1-10, issn 0166-218XArticle

Sur une classe de transformations d'arbres = On a class of tree-transformationsBOZAPALIDIS, S.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 1, pp 43-47, issn 0988-3754Article